41![“Ooh Aah... Just a Little Bit” : A small amount of side channel can go a long way Naomi Benger1 , Joop van de Pol2 , Nigel P. Smart2 , and Yuval Yarom1 1 School of Computer Science, The University of Adelaide, Austr “Ooh Aah... Just a Little Bit” : A small amount of side channel can go a long way Naomi Benger1 , Joop van de Pol2 , Nigel P. Smart2 , and Yuval Yarom1 1 School of Computer Science, The University of Adelaide, Austr](https://www.pdfsearch.io/img/713c603b1fae2a0ab784a71a78e477cd.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2014-06-02 03:54:18
|
---|
42![Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed] Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]](https://www.pdfsearch.io/img/f61278e4aa20c9cd4676cf8dd2812925.jpg) | Add to Reading ListSource URL: www.hpl.hp.comLanguage: English - Date: 1999-09-08 19:15:27
|
---|
43![Combining symbolic and numeric techniques for DL contents classification and analysis Jean-Charles LAMIREL, Yannick TOUSSAINT Abstract The goal of this article is to prove that the mixture of different classification and Combining symbolic and numeric techniques for DL contents classification and analysis Jean-Charles LAMIREL, Yannick TOUSSAINT Abstract The goal of this article is to prove that the mixture of different classification and](https://www.pdfsearch.io/img/b9c2b2f44c16f88f53b93f937fa1212b.jpg) | Add to Reading ListSource URL: www.ercim.euLanguage: English - Date: 2008-12-08 05:11:33
|
---|
44![NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e. NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.](https://www.pdfsearch.io/img/a8b9c1007c3692f71d890ef925637e5e.jpg) | Add to Reading ListSource URL: math.stanford.eduLanguage: English - Date: 2014-07-08 11:03:33
|
---|
45![Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed] Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]](https://www.pdfsearch.io/img/a02a70150002432d37d6e974ed4442ac.jpg) | Add to Reading ListSource URL: www.math.unicaen.frLanguage: English - Date: 2011-09-02 16:54:04
|
---|
46![NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e. NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.](https://www.pdfsearch.io/img/83dad368f50ee1d199147145038cd599.jpg) | Add to Reading ListSource URL: math.stanford.eduLanguage: English - Date: 2014-04-07 08:15:47
|
---|
47![Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia](https://www.pdfsearch.io/img/89df51bdbe66657119ee8a8b344e7e80.jpg) | Add to Reading ListSource URL: www.numbertheory.orgLanguage: English - Date: 2002-01-22 06:23:32
|
---|
48![PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for](https://www.pdfsearch.io/img/5062aecb61bb93e2d2007a618af31d09.jpg) | Add to Reading ListSource URL: www.numbertheory.orgLanguage: English - Date: 2011-09-25 12:09:55
|
---|
49![(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1 (Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1](https://www.pdfsearch.io/img/830036f12ed787255ba939a960a44a1c.jpg) | Add to Reading ListSource URL: www.numbertheory.orgLanguage: English - Date: 2011-09-25 12:54:28
|
---|
50![! !](https://www.pdfsearch.io/img/9bc8b76827eeead1f04e55eefb37943a.jpg) | Add to Reading ListSource URL: www.signelec.comLanguage: English - Date: 2010-02-23 06:23:32
|
---|